UNIVERSITY OF SUSSEX COMPUTER SCIENCE A typed, prioritized process algebra Alan Jeffrey

Source URL: ect.bell-labs.com

• Bisimulation
• Logic in computer science
• Theoretical computer science
• Substitution
• Generalised Whitehead product

Optimizing the Runtime Processing of Types in a Higher-Order Logic Programming Language Gopalan Nadathur and Xiaochu Qi Department of Computer Science and Engineering, University of Minnesota, 4-192 EE/CS Building, 200 U

Source URL: www-users.cs.umn.edu

Logic Programming in Tabular Allegories∗ Emilio Jesús Gallego Arias1 and James B. Lipton2 1 2 Universidad Politécnica de Madrid

Source URL: drops.dagstuhl.de

• Model theory
• Mathematical logic
• Automated theorem proving
• Logic programming
• Logic in computer science
• Allegory
• Pullback
• Substitution
• Structure
• Unification
• Kripke semantics
• Interpretation

Electronic Notes in Theoretical Computer Science (Preliminary Versions) 15th workshop on functional and (constraint) logic programming WFLP’06

Source URL: gpd.sip.ucm.es

Semantics for core Concurrent ML using computation types Alan Jeffrey Abstract This paper presents two typed higher-order concurrent functional programming languages, based on Reppy’s Concurrent ML. The first is a simp

Source URL: ect.bell-labs.com

• Theoretical computer science
• Logic in computer science
• Software engineering
• Formal methods
• Programming language semantics
• Models of computation
• Operational semantics
• Semantics
• Bisimulation
• Process calculus
• Programming language
• Transition system

Domain Theory Corrected and expanded version Samson Abramsky1 and Achim Jung2 This text is based on the chapter Domain Theory in the Handbook of Logic in Computer Science, volume 3, edited by S. Abramsky, Dov M. Gabbay,

Source URL: www.cs.bham.ac.uk

Logic in Automatic Verification Javier Esparza Sofware Reliability and Security Group Institute for Formal Methods in Computer Science University of Stuttgart

Source URL: www7.in.tum.de

The Why3 platform Version, May 2015 François Bobot1,2 Jean-Christophe Filliâtre1,2

Source URL: why3.lri.fr

• Proof assistants
• Functional languages
• Theoretical computer science
• Formal methods
• Logic in computer science
• Frama-C
• SPARK
• Coq
• Isabelle
• OCaml
• Formal verification
• French Institute for Research in Computer Science and Automation

Logical Preliminaries Johannes C. Flieger Scheme UK March 2003 Abstract Survey of intuitionistic and classical propositional logic; introduction to the computational interpretation of intuitionistic logic in the

Source URL: schematics.sourceforge.net

• Proof theory
• Mathematical logic
• Logic
• Mathematics
• CurryHoward correspondence
• Dependently typed programming
• Logic in computer science
• Philosophy of computer science
• Type theory
• Symbol
• Sequent
• Confidence interval

Gundersen, T., Heijltjes, W. and Parigot, MAtomic lambda-calculus : A typed lambda-calculus with explicit sharing. In: Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, pp. 31

Source URL: www.cs.bath.ac.uk